Designing Customer Target Recommendation System Using K-Means Clustering Method

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recommendation of Web Pages using Weighted K-Means Clustering

Web Recommendation Systems are implemented by using collaborative filtering approach. It is a specific type of information filtering system that aims to predict the user browsing activity and then recommend to the user web pages items that are likely to be of interest. In this paper, a new recommendation system is proposed by using Weighted K-Means clustering approach to predict the user's...

متن کامل

Recommendation System for Criminal Behavioral Analysis on Social Network using Genetic Weighted K-Means Clustering

The accessibility and usage of social networking sites constructs both prospects and menaces for the users. In this research article, we propose a new recommendation system for predicting and recommending the criminal behavioral users on social network based upon the activities of the users. Our recommender system uses the proposed nine factor analysis method, clustering technique called Geneti...

متن کامل

Hedge Fund Classification using K-means Clustering Method

Hedge fund databases vary as to the type of funds to include and in their classification scheme. Investment strategy and/or investment style are the basis for classification. Considerable variation is observed in the definitions, return calculation methodologies, and assumptions. There exists a myriad of classifications, some overlapping and some mutually exclusive. There is a need for an ‘alte...

متن کامل

Hartigan's Method: k-means Clustering without Voronoi

Hartigan’s method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuristic, one leading to a number of consistency properties, the other showing that the data partition is always quite separated from the induced Voronoi partition. A characterization of the volume of this separation is provide...

متن کامل

Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm

Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IJITEE (International Journal of Information Technology and Electrical Engineering)

سال: 2017

ISSN: 2550-0554

DOI: 10.22146/ijitee.25155